#include<iostream>
using namespace std;
const int N = 30;
int a[N+1];
int main(){
	//奇数位置的元素与其右边相邻的偶数位置的元素交换位置
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
    }

    for (int i = 1; i <= n - 1; i += 2){
    	swap(a[i],a[i + 1]); 
    }
    
    for (int i = n; i >= 1; i--){
        cout << a[i] << " ";
    }        
	return 0;
}